A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments

نویسندگان

  • Masaaki Mizuno
  • Hirotsugu Kakugawa
چکیده

There are several models for which self-stabilizing programs have been developed. The distributed model accurately reeects a real distributed computing environment; therefore, programs developed for the model should run directly on a distributed system. However, many self-stabilizing programs have been developed for the serial model which has the strongest assumptions , because a program developed for the model is much easier to prove correct than one for other models. This paper presents a transformation method that converts a program designed for the serial model to a program for the distributed model that simulates the original program. A transformed program is incorporated with a self-stabilizing concurrency control protocol to guarantee that if the original program is self-stabilizing, the transformed program is also self-stabilizing and performs exactly like the original program.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Timestamp Based Transformation ofSelf - Stabilizing Programs for DistributedComputing

There are several models for which self-stabilizing (SS) programs have been developed. The distributed model accurately reeects a real distributed computing environment; therefore, programs developed for the model should run directly on a distributed system. However, many SS programs have been developed for the serial model which has the strongest assumptions, because it is much easier to devel...

متن کامل

A Timestamp Based Transformation ofSelf - Stabilizing Programs for

There are several models for which self-stabilizing (SS) programs have been developed. The distributed model accurately reeects a real distributed computing environment; therefore, programs developed for the model should run directly on a distributed system. However, many SS programs have been developed for the serial model which has the strongest assumptions, because it is much easier to devel...

متن کامل

A New Framework for Design, Veri cation, and Implementation of Self-Stabilizing Distributed Algorithms

Design, veri cation, and implementation of reliable distributed programs are a di cult task. In a separate paper, we have presented an algorithm that transforms self-stabilizing (SS) serial model programs to equivalent programs that run on real distributed systems. This paper presents a method to develop new SS distributed programs by using the transformation; that is, we develop and verify SS ...

متن کامل

A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model

Several self-stabilizing time division multiple access (TDMA) algorithms are proposed for sensor networks. In addition to providing a collision-free communication service, such algorithms enable the transformation of programs written in abstract models considered in distributed computing literature into a model consistent with sensor networks, i.e., write all with collision (WAC) model. Existin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996